Yet another variation on minimal linear codes
نویسندگان
چکیده
منابع مشابه
On Minimal and Almost-Minimal Linear Codes
Minimal linear codes are such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing and secure two-party computations. We pursue here the study of minimal codes and construct infinite families with asymptotically non-zero rates. We also introduce a relaxation to almost minima...
متن کاملVariations on Minimal Linear Codes
Minimal linear codes are linear codes such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing. We pursue here their study and construct asymptotically good families of minimal linear codes. We also push further the study of quasi-minimal and almost-minimal linear codes, re...
متن کاملBounds on Minimal Codewords in Linear Codes
The notion of minimal codewords in linear codes was introduced recently by Massey. In this paper two weight bounds on minimal code-words are proved; an upper bound above which no codewords are minimal and a lower bound below which all codewords are minimal. It is shown for Hamming codes that every weight class between the two bounds contains at least one minimal codeword and at least one non-mi...
متن کاملYet Another Attack on Vest
We present a new side-channel attack against VEST, a set of four stream ciphers which reached the second phase of the eSTREAM project (the European stream cipher project). The proposed attacks target the counter part of the ciphers, composed of 16 short-length nonlinear feedback shift registers (NLFSR) independently updated. Our aim is to retrieve the whole initial state of the counter (163 to ...
متن کاملPredicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a category enjoying many algebraic properties. We build on this structure to make predicate transformers into a denotational model of full linear logic: all the logical constructions have a natural interpretation in term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2016
ISSN: 1930-5346
DOI: 10.3934/amc.2016.10.53